Inference of higher order substitution dynamics by Markov chain lumping

نویسندگان

  • Olof Gornerup
  • Martin Nilsson Jacobi
چکیده

We apply Markov chain lumping techniques to aggregate codons from an empirical substitution matrix. The standard genetic code as well as higher order amino acid substitution groups are identified. Since the aggregates are derived from first principles they do not rely on system dependent assumptions made beforehand, e.g. regarding criteria on what should constitute an amino acid group. We therefore argue that the acquired aggre-gations more accurately capture the multi-level structure of the substitution dynamics than alternative techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lumpings of Markov Chains, Entropy Rate Preservation, and Higher-Order Lumpability

A lumping of a Markov chain is a coordinate-wise projection of the chain. We characterise the entropy rate preservation of a lumping of an aperiodic and irreducible Markov chain on a finite state space by the random growth rate of the cardinality of the realisable preimage of a finite-length trajectory of the lumped chain and by the information needed to reconstruct original trajectories from t...

متن کامل

Coalescent experiments I: Unlabeled n-coalescent and the site frequency spectrum

We derive the transition structure of a Markovian lumping of Kingman’s n-coalescent [1, 2]. Lumping a Markov chain is meant in the sense of [3, def. 6.3.1]. The lumped Markov process, referred as the unlabeled n-coalescent, is a continuous-time Markov chain on the set of all integer partitions of the sample size n. We derive the backwardtransition, forward-transition, state-specific, and sequen...

متن کامل

Bounding the lumping error in Markov chain dynamics

Forming lumped states in a Markov chain is a very useful device leading to a coarser level of description. The Markov chain on these lumped states is often taken as an approximation for the time evolution of the unlumped chain. In the present work we derive a bound on the error in this approximation.

متن کامل

A Symbolic Algorithm for Optimal Markov Chain Lumping

Many approaches to tackle the state explosion problem of Markov chains are based on the notion of lumpability, which allows computation of measures using the quotient Markov chain, which, in some cases, has much smaller state space than the original one. We present, for the first time, a symbolic algorithm and its implementation for the lumping of Markov chains that are represented using Multi-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008